Embedding of complete graphs in broken Chimera graphs
نویسندگان
چکیده
In order to solve real world combinatorial optimization problems with a D-Wave quantum annealer it is necessary embed the problem at hand into hardware graph, namely Chimera or Pegasus. Most hard exhibit strong connectivity. For worst case scenario of complete there exists an efficient solution for embedding ideal graph. However, since machines almost always have broken qubits find We present new approach graphs graphs. This can be formulated as problem, more precisely matching additional linear constraints. Although being NP-hard in general fixed parameter tractable number inaccessible vertices tested our exact on various instances graphs, both related well randomly generated. runtime, we were able larger compared previous, heuristic approaches. As extension, developed fast algorithm which enables us even instances. performance and
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملEmbedding Complete Binary Trees in Product Graphs
This paper shows how to embed complete binary trees in products of complete binary trees products of shu e exchange graphs and products of de Bruijn graphs The main emphasis of the embedding methods presented here is how to emulate arbitrarily large complete bi nary trees in these product graphs with low slowdown For the embedding methods presented here the size of the host graph can be xed to ...
متن کاملFaster Isometric Embedding in Products of Complete Graphs
An isometric embedding of a connected graph G into a Cartesian product of complete graphs is equivalent to a labeling of each vertex of G by a string of fixed length such that the distance in G between two vertices is equal to the Hamming distance between their labels. We give a simple O(D(m, n) + n’)-time algorithm for deciding if G admits such an embedding, and for labeling G if one exists, w...
متن کاملEmbedding Graphs into Embedded Graphs
A drawing of a graph G in the plane is weakly simple if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph G in the plane is weakly simple, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class. In other words, we show that c-planarity with pipes is tractab...
متن کاملHomogeneously Embedding Stratified Graphs in Stratified Graphs
A 2-stratified graph G is a graph whose vertex set has been partitioned into two subsets, called the strata or color classes of G. Two 2-stratified graphs G and H are isomorphic if there exists a color-preserving isomorphism φ from G to H. A 2-stratified graph G is said to be homogeneously embedded in a 2-stratified graph H if for every vertex x of G and every vertex y of H, where x and y are c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2021
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-021-03168-z